منابع مشابه
Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...
متن کاملOn bipartite Q-polynomial distance-regular graphs
Let Γ denote a bipartite Q-polynomial distance-regular graph with vertex set X, diameter d ≥ 3 and valency k ≥ 3. Let RX denote the vector space over R consisting of column vectors with entries in R and rows indexed by X. For z ∈ X, let ẑ denote the vector in RX with a 1 in the z-coordinate, and 0 in all other coordinates. Fix x, y ∈ X such that ∂(x, y) = 2, where ∂ denotes path-length distance...
متن کاملThe Hyper-Wiener Polynomial of Graphs
The distance $d(u,v)$ between two vertices $u$ and $v$ of a graph $G$ is equal to the length of a shortest path that connects $u$ and $v$. Define $WW(G,x) = 1/2sum_{{ a,b } subseteq V(G)}x^{d(a,b) + d^2(a,b)}$, where $d(G)$ is the greatest distance between any two vertices. In this paper the hyper-Wiener polynomials of the Cartesian product, composition, join and disjunction of graphs are compu...
متن کاملA characterization of Q-polynomial distance-regular graphs
We obtain the following characterization of Q-polynomial distance-regular graphs. Let Γ denote a distance-regular graph with diameter d ≥ 3. Let E denote a minimal idempotent of Γ which is not the trivial idempotent E0. Let {θ∗ i }i=0 denote the dual eigenvalue sequence for E. We show that E is Q-polynomial if and only if (i) the entry-wise product E ◦ E is a linear combination of E0, E, and at...
متن کاملThe Parameters of Bipartite Q-polynomial Distance-Regular Graphs
Let denote a bipartite distance-regular graph with diameter D ≥ 3 and valency k ≥ 3. Suppose θ0, θ1, . . . , θD is a Q-polynomial ordering of the eigenvalues of . This sequence is known to satisfy the recurrence θi−1 − βθi + θi+1 = 0 (0 < i < D), for some real scalar β. Let q denote a complex scalar such that q + q−1 = β. Bannai and Ito have conjectured that q is real if the diameter D is suffi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2017.03.016